Fft Benchmarking for Digital Signal Processing Technologies
نویسندگان
چکیده
− An appropriate choice of the computing devices employed in digital signal processing applications requires to characterize and to compare various technologies, so that the best component in terms of cost and performance can be used in a given system design. In this paper, a benchmark strategy is presented to measure the performances of various types of digital signal processing devices. Although different metrics can be used as performance indexes, Fast Fourier Transform (FFT) computation time and Real-Time Bandwidth (RTBW) have proved to be excellent and complete performance parameters. Moreover, a new index, measuring the architectural efficiency in computing FFT, is introduced and explained. Both parameters can be used to compare several digital signal processing technologies, thus guiding designers in optimal component selection.
منابع مشابه
A Comparative Analysis of Fft Algorithms
With the rapid development of computer technology, general purpose CPUs have made inroads into many signal processing applications; of which the Fast Fourier Transform (FFT) continues to be an integral part. A large number of FFT algorithms have been developed over the years, notably the Radix-2, Radix-4, Split-Radix, Fast Hartley Transform (FHT), Quick Fourier Transform (QFT), and the Decimati...
متن کاملDigital Binary Phase-shift Keyed Signal Detector
We have developed the effective algorithm for detecting digital binary phase-shift keyed signals. This algorithm requires a small number of arithmetic operations over the signal period. It can be relatively easy implemented based on the modern programmable logic devices. It also provides high interference immunity by identifying signal presence when signal-to-noise ratio is much less that its w...
متن کاملA Parallel-Pipelined Constant Geometry Algorithm (PCGA) for Computation of FFT on a Special Processor
In digital signal processing applications, we usually use DFT (discrete Fourier transform) to transfer signal from time-domain to frequency-domain. In past decades, there were many papers discussing and exploiting FFT (fast Fourier transform) architectures for hardware implementation. In this paper, we proposed a novel VLSI FFT processor based on parallel-pipelined constant geometry algorithm (...
متن کاملDesign of A Novel 8-point Modified R2MDC with Pipelined Technique for High Speed OFDM Applications
This study presents, design of modified R2MDC with pipelined Technique. Radix-2 Multipath Delay commutators is the one type of Radix-2 FFT. Wireless networks have found a significant place in the growing technologies. Orthogonal Frequency Division Multiplexing (OFDM) is a key technique used in wireless networks for high speed operation, high data capacity and spectral efficiency. The Fast Fouri...
متن کاملA GPU Based Memory Optimized Parallel Method For FFT Implementation
FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially in remote sensing, which large amounts of data need to be processed with FFT. So shortening the FFT computation time is particularly important. GPU (Graphic...
متن کامل